Unitary coined discrete-time quantum walks on directed multigraphs
نویسندگان
چکیده
Unitary coined discrete-time quantum walks (UCDTQW) constitute a universal model of computation, meaning that any computation done by general purpose computer can either be using the UCDTQW framework. In last decades, great progress has been made in this field developing walk-based algorithms outperform classical ones. However, current computers work based on circuit and mapping from one to other is still an open problem. work, we provide matrix analysis unitary evolution operator UCDTQW, which composed at time shift coin operators. We conceive system as form adjacency associated with graph takes place, set equations transform latter into former vice versa. modifies structure original directed multigraph, splitting single edges arcs multiple arcs. Thus, fact representation means complies transformation will automatically circuit, acting bipartite always multigraph. Finally, extend definition superposition coins such way each acts different vertices multigraph description how implemented form.
منابع مشابه
Evanescence in Coined Quantum Walks
In this paper we complete the analysis begun by two of the authors in a previous work on the discrete quantum walk on the infinite line [J. Phys. A 36:8775-8795 (2003); quant-ph/0303105]. We obtain uniformly convergent asymptotics for the “exponential decay” regions at the leading edges of the main peaks in the Schrödinger (or wave-mechanics) picture. This calculation required us to generalise ...
متن کاملConvergence of coined quantum walks on R
Coined quantum walks may be interpreted as the motion in position space of a quantum particle with a spin degree of freedom; the dynamics are determined by iterating a unitary transformation which is the product of a spin transformation and a translation conditional on the spin state. Coined quantum walks on Z can be treated as special cases of coined quantum walks on R. We study quantum walks ...
متن کاملCoined Quantum Walks on Weighted Graphs
We define a discrete-time, coined quantum walk on weighted graphs that is inspired by Szegedy’s quantum walk. Using this, we prove that many lackadaisical quantum walks, where each vertex has l integer self-loops, can be generalized to a quantum walk where each vertex has a single self-loop of realvalued weight l. We apply this real-valued lackadaisical quantum walk to two problems. First, we a...
متن کاملLine Digraphs and Coined Quantum Random Walks
In this note, we give a characterization of the adjacency matrix of the line digraph of a regular digraph and we discuss a generalization.On the light of the characterization given, we remark that the underlying digraph of a coined quantum random walk is the line digraph of a regular digraph. 1. A characterization of the adjacency matrix of the line digraph of a regular digraph 1.1. Set-up. The...
متن کاملAsymptotic dynamics of coined quantum walks on percolation graphs.
Quantum walks obey unitary dynamics: they form closed quantum systems. The system becomes open if the walk suffers from imperfections represented as missing links on the underlying basic graph structure, described by dynamical percolation. Openness of the system's dynamics creates decoherence, leading to strong mixing. We present a method to analytically solve the asymptotic dynamics of coined,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information Processing
سال: 2023
ISSN: ['1573-1332', '1570-0755']
DOI: https://doi.org/10.1007/s11128-023-04004-2